Treewidth of Line Graphs
نویسندگان
چکیده
We determine the exact treewidth of the line graph of the complete graph. More generally, we determine the exact treewidth of the line graph of a regular complete multipartite graph. For an arbitrary complete multipartite graph, we determine the treewidth of the line graph up to a lower order term.
منابع مشابه
The Treewidth of Line Graphs
The treewidth of a graph is an important invariant in structural and algorithmic graph theory. This paper studies the treewidth of line graphs. We show that determining the treewidth of the line graph of a graph G is equivalent to determining the minimum vertex congestion of an embedding of G into a tree. Using this result, we prove sharp lower bounds in terms of both the minimum degree and ave...
متن کاملDrawing Planar Graphs with Many Collinear Vertices
Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line drawing of G? This problem resides at the core of several graph drawing problems, including universal point subsets, untangling, and column planarity. The following results are known: Every n-vertex planar graph has a planar straight-line drawing with Ω( √ n) collinear vertices; for every n, there...
متن کاملCombinatorial Auctions with Structured Item Graphs
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We study the setting where there is a graph (with some desired property), with the items as vertices, and every bid bids on a connected set of items. Two computational problems arise: 1) clearing the auction when given the...
متن کاملDistinct Distances in Graph Drawings
The distance-number of a graph G is the minimum number of distinct edgelengths over all straight-line drawings of G in the plane. This definition generalises many well-known concepts in combinatorial geometry. We consider the distancenumber of trees, graphs with no K− 4 -minor, complete bipartite graphs, complete graphs, and cartesian products. Our main results concern the distance-number of gr...
متن کاملStructure of Graphs with Locally Restricted Crossings
We consider relations between the size, treewidth, and local crossing number (maximum number of crossings per edge) of graphs embedded on topological surfaces. We show that an n-vertex graph embedded on a surface of genus g with at most k crossings per edge has treewidth O( √ (g + 1)(k + 1)n) and layered treewidth O((g + 1)k) and that these bounds are tight up to a constant factor. In the speci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012